Subpath acyclic digraphs
نویسندگان
چکیده
A characterization is given for acyclic digraphs that are the acyclic intersection digraphs of subpaths of a directed tree.
منابع مشابه
THE RELATION BETWEEN TOPOLOGICAL ORDERING AND ADJACENCY MATRIX IN DIGRAPHS
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...
متن کاملAlternative Markov and Causal Properties for Acyclic
Proof. Suppose that ρ has a collider C such that C ∈ AnG(D) ∖ AnG(Z) with D ∈ X, or C ∈ AnG(E)∖AnG(Z) with E ∈ Y . Assume without loss of generality that C ∈ AnG(D)∖AnG(Z) with D ∈X because, otherwise, a symmetric argument applies. Then, replace the subpath of ρ between A and C with D ← . . .← C. Note that the resulting path (i) has no non-collider in Z unless A−C −B is a subpath of ρ and PaG(C...
متن کاملA New Proof of Berge’s Strong Path Partition Conjecture for Acyclic Digraphs
Berge’s elegant strong path partition conjecture from 1982 extends the Greene-Kleitman Theorem and Dilworth’s Theorem for all digraphs. The conjecture is known to be true for all digraphs for k = 1 by the Gallai-Milgram Theorem, and for k > 1 only for acyclic digraphs. We present a simple algorithmic proof for k = 1 which naturally extends to a new algorithmic proof for acyclic digraphs for all...
متن کاملMaximum directed cuts in acyclic digraphs
It is easily shown that every digraph with m edges has a directed cut of size at least m/4, and that 1/4 cannot be replaced by any larger constant. We investigate the size of a largest directed cut in acyclic digraphs, and prove a number of related results concerning cuts in digraphs and acyclic digraphs.
متن کاملTabulation of Noncrossing Acyclic Digraphs
I present an algorithm that, given a number $n \geq 1$, computes a compact representation of the set of all noncrossing acyclic digraphs with $n$ nodes. This compact representation can be used as the basis for a wide range of dynamic programming algorithms on these graphs. As an illustration, along with this note I am releasing the implementation of an algorithm for counting the number of noncr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 154 شماره
صفحات -
تاریخ انتشار 1996